in this paper, a general solution for torsion of hollow cylinders made of functionally graded materials (fgm) was investigated. the problem was formulated in terms of prandtl’s stress and, in general, the shear stress and angle of twist were derived. variations in the material properties such as young’s modulus and poisson’s ratio might be arbitrary functions of the radial coordinate. various m...

The Gaussian arbitrarily varying channel with input constraint r and state constraint 2 admits input sequences x = ( x l , , x , ~ ) of real numbers with Cxf 5 nT and state sequences s = ( 5 ,. , T , ~ ) of real numbers with L Y ~ 5 H A ; the output sequence x + s + V , where V = ( VI, , y , ) is a sequence of independent and identically distributed Gaussian random variables with mean 0 and var...

The random coding capacity of a vector Gaussian arbitrarily varying channel (VGAVC) is determined, along with a simple general method for computing this capacity. The VGAVC is a discrete-time memoryless vector channel with an input power constraint and additive Gaussian noise that is further corrupted by an additive “jamming signal.” The statistics of this jamming signal are unknown and may be ...

In this article we study a channel with arbitrarily varying channel probability functions in the presence of a noiseless feedback channel (a. v. ch. f.). We determine its capacity by proving a coding theorem and its strong converse. Our proof of the coding theorem is constructive; we give explicitly a coding scheme which performs at any rate below the capacity with an arbitrarily small decoding...

Abstruct-The random-code capacity region of the multiple-access arbitrarily varying channel subject to both state and input constraints is determined. Consideration of a simple erasure channel shows that the capacity region is not convex in general.

" r? Let X~= X and Y~= Y for t = 1, 2 . . . . . X, ,= ~ X ~ and !1, = Y~. Let S be any set, cg = {w(. 1" I s ) lseS} t = l t = l n be a set of (a x 2) stochastic matrices w( ' l ' ls) , and St=S , t= 1 . . . . . n. For every sn=(s 1 . . . . . s " ) e H S t n t = l define P (. ]" Is.) by P (y.[x.ls.) = I~ w (yt]x~lst) for every x. = (x a . . . . . x")~ X . and every y. = (yl, ... , y.)e 11.. t =...

We consider the problem of communicating over an unknown and arbitrarily varying channel, using feedback. This paper focuses on the problem of determining the input behavior, or more specifically, a prior which is used to randomly generate a codebook. We pose the problem of setting the prior as a universal sequential prediction problem using information theoretic abstractions of the communicati...

| The random-code capacity region of the multiple-access arbitrarily varying channel subject to both state and input constraints is determined. Consideration of a simple erasure channel shows that the capacity region is not convex in general.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission....

A well-known result of Ahlswede asserts that the determinis-tic code capacity of an arbitrarily varying channel (AVC), under the average error probability criterion, either equals its random code capacity or else is zero. A necessary and sufficient condition is identified for deciding between these alternatives, namely, the capacity is zero if and only if the AVC is symmetrizable. The capacity ...